Moving Target Search Algorithm with Informational Distance Measures
نویسندگان
چکیده
منابع مشابه
Moving Target Search Algorithm with Informational Distance Measures
We consider an Ishida and Korf Moving Target Search (MTS) algorithm with informational distance measures. Similarly to the previously defined Informational Learning Real-Time A* algorithm, the suggested algorithm acts on the set of partitions of the sample space, on which the probability mass function is defined. The information-based Rokhlin metric and its lower bound – Ornstein metric, give t...
متن کاملMoving Target Search
We consider the case of heuristic search where the location of the goal may change during the course of the search. For example, the goal may be a target that is actively avoiding the problem solver. We present a moving target search algorithm (MTS) to solve this problem. We prove that if the average speed of the target is slower than that of the problem solver, then the problem solver is guara...
متن کاملApplying Coordination in Moving Target Search (MTS) Algorithm
Multi Agent System, where multiple agents concurrently and autonomously search to find a target, is regarded as a promising paradigm for future distributed computing. Agents often do not know the terrain in advance but automatically observe it within a certain range around it. In real time heuristic search such as Moving Target search (MTS), we have to commit a move within a limited search hori...
متن کاملAlgorithm Comparison for Moving Target Search CMPUT 651 Midterm Report
For moving target search algorithms, we are considering the case of heuristic search where the goal may change during the course of the search. One motivating application lies with navigation of an autonomous police vehicle chasing a villain [5] in a possibly initially unknown environment under real-time constraints. In this scenario, we would like to assure that the autonomous vehicle can quic...
متن کاملMoving Target Search with Subgoal Graphs
Moving Target Search (MTS) is a dynamic path planning problem, where an agent is trying to reach a moving entity with a minimum path cost. Problems of this nature can be found in video games and dynamic robotics, which require fast processing time (real time). In this work, we introduce a new algorithm for this problem the Moving Target Search with Subgoal Graphs (MTSub). MTSub is based on envi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Open Applied Informatics Journal
سال: 2013
ISSN: 1874-1363
DOI: 10.2174/1874136320130604001